|
|
Principals, switching functions and routing techniques in computer networks
Dvořák, Pavel ; Pelka, Tomáš (referee) ; Polívka, Michal (advisor)
This bachelor thesis consider main principles and function of active network components. Mainly is intent to component working on the third level of referential model ISO/OSI, router. There are described its main parts and more closely charactered routing protocols. Then is verified the ability of dynamic routing to react to failure in the network and there is measured the reaction time of crossing to secondary route when using different routing protocols. Another part of the thesis is focused on the questions of Quality of Service (QoS) and its support in computer networks. There are explored various ways of the QoS configuration on the routers and the proper of them is chosen and applied to the test network.
|
|
|
Use of a simulation model for the development of an automatic algorithm for creating a routing table and path evaluation in a conveyor system
Weyrová, Dominika ; Simeonov, Simeon (referee) ; Hromková, Ivana (advisor)
The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.
|
|
|
New scenarios with Wireshark in communication technologies
Šíma, Jan ; Dvořák, Jan (referee) ; Jeřábek, Jan (advisor)
The aim of this thesis is to design and create scenarios that will be used by students as a basis for laboratory exercises in a course that focuses on communication technologies. These scenarios also need to be accompanied by a theoretical introduction that will introduce the topic under discussion to the students. The created scenarios contain additional tasks that are intended for individual work of students. For the teachers there are prepared separate files summarising the correct solution of these tasks. This thesis starts with a theoretical description of used network protocols. First the TCP/IP model is described and then the protocols that belong to this model. The main ones are those that occur in multiple created scenarios, such as TCP, UDP or DNS. The programs and applications that are used in the scenarios are also described. The main program is Wireshark and also the application called Klient DNS. This is followed by a chapter that deals with the drafting of each scenario. The drafts outline what the scenarios goals are. The drafts also list the protocols, programs, and utilities that are used in the exercise. The first scenario contains tasks based on Network Address Translation and its interaction with other protocols, such as the previously mentioned TCP, UDP, and also ICMP and FTP protocols. The second created scenario is dealing and analyzing protocols that try to secure the translation of domain names. Specifically, the DNSSEC extension and also the DoH protocol. The third scenario is focusing more in detail at the function of recursive servers in DNS and DNSSEC communication. The last created scenario explains the planning and allocation of the address space, where again the NAT topic is encountered and the function of routing tables is also explained here.
|
|
|
Warehouse modeling using graphical user interface
Rajnoha, Martin ; Mašek, Jan (referee) ; Burget, Radim (advisor)
Master’s thesis proposes a new algorithm which enables efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any places in warehouse based on Breadth first search, image processing „skeletonization“ and Dijkstra algorithm. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is less then milisecond using routing table and even size of warehouse doesn’t affect it significantly instead of using Dijkstra algorithm.
|
|
|
Router principles illustrating software for teaching support
Sobek, Jiří ; Vymazal, Michal (referee) ; Vychodil, Petr (advisor)
This bachelor thesis is mainly focused on the network functionality and its key component, the router. The main points of this work are an explanation of the network principles and router functions which are extended with information about routing protocols and its mutual separation. The practical part considers a realization of applets which should serve as a school software. In detail they explain the way of routing protocols work and its inner structure. Simultaneously consider the principles of two significant routing protocols such as Open Shortest Path First (OSPF) and Routing Information Protocol (RIP). All of the applets are finally loaded on the web page which helps to their visitors understand the complexity of routing and other infomation.
|
|
|
New scenarios with Wireshark in communication technologies
Šíma, Jan ; Dvořák, Jan (referee) ; Jeřábek, Jan (advisor)
The aim of this thesis is to design and create scenarios that will be used by students as a basis for laboratory exercises in a course that focuses on communication technologies. These scenarios also need to be accompanied by a theoretical introduction that will introduce the topic under discussion to the students. The created scenarios contain additional tasks that are intended for individual work of students. For the teachers there are prepared separate files summarising the correct solution of these tasks. This thesis starts with a theoretical description of used network protocols. First the TCP/IP model is described and then the protocols that belong to this model. The main ones are those that occur in multiple created scenarios, such as TCP, UDP or DNS. The programs and applications that are used in the scenarios are also described. The main program is Wireshark and also the application called Klient DNS. This is followed by a chapter that deals with the drafting of each scenario. The drafts outline what the scenarios goals are. The drafts also list the protocols, programs, and utilities that are used in the exercise. The first scenario contains tasks based on Network Address Translation and its interaction with other protocols, such as the previously mentioned TCP, UDP, and also ICMP and FTP protocols. The second created scenario is dealing and analyzing protocols that try to secure the translation of domain names. Specifically, the DNSSEC extension and also the DoH protocol. The third scenario is focusing more in detail at the function of recursive servers in DNS and DNSSEC communication. The last created scenario explains the planning and allocation of the address space, where again the NAT topic is encountered and the function of routing tables is also explained here.
|
|
|
Use of a simulation model for the development of an automatic algorithm for creating a routing table and path evaluation in a conveyor system
Weyrová, Dominika ; Simeonov, Simeon (referee) ; Hromková, Ivana (advisor)
The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents a proposal for the principle of the algorithm for evaluating the routes of the transport system, including dynamic criteria and their optimization.
|
|
|
Warehouse modeling using graphical user interface
Rajnoha, Martin ; Mašek, Jan (referee) ; Burget, Radim (advisor)
Master’s thesis proposes a new algorithm which enables efficient conversion of graphical representation of warehouse into graph theory representation and consequently accelerates estimation for route costs. The proposed algorithm computes route distances between any places in warehouse based on Breadth first search, image processing „skeletonization“ and Dijkstra algorithm. Using the proposed algorithm it is possible to search routes in a warehouse effectively and fast using precomputed routing table. Searching time is less then milisecond using routing table and even size of warehouse doesn’t affect it significantly instead of using Dijkstra algorithm.
|
|
|
Router principles illustrating software for teaching support
Sobek, Jiří ; Vymazal, Michal (referee) ; Vychodil, Petr (advisor)
This bachelor thesis is mainly focused on the network functionality and its key component, the router. The main points of this work are an explanation of the network principles and router functions which are extended with information about routing protocols and its mutual separation. The practical part considers a realization of applets which should serve as a school software. In detail they explain the way of routing protocols work and its inner structure. Simultaneously consider the principles of two significant routing protocols such as Open Shortest Path First (OSPF) and Routing Information Protocol (RIP). All of the applets are finally loaded on the web page which helps to their visitors understand the complexity of routing and other infomation.
|
|
|
Principals, switching functions and routing techniques in computer networks
Dvořák, Pavel ; Pelka, Tomáš (referee) ; Polívka, Michal (advisor)
This bachelor thesis consider main principles and function of active network components. Mainly is intent to component working on the third level of referential model ISO/OSI, router. There are described its main parts and more closely charactered routing protocols. Then is verified the ability of dynamic routing to react to failure in the network and there is measured the reaction time of crossing to secondary route when using different routing protocols. Another part of the thesis is focused on the questions of Quality of Service (QoS) and its support in computer networks. There are explored various ways of the QoS configuration on the routers and the proper of them is chosen and applied to the test network.
|
guest ::
